Nearest-neighbor two-point correlation function of the Z-invariant eight-vertex model
نویسندگان
چکیده
منابع مشابه
Query Point Nearest Neighbor
We explore the eeect of dimensionality on the \nearest neigh-bor" problem. We show that under a broad set of conditions (much broader than independent and identically distributed dimensions), as di-mensionality increases, the distance to the nearest data point approaches the distance to the farthest data point. To provide a practical perspective , we present empirical results on both real and s...
متن کاملCrystal plasticity simulations using nearest neighbor orientation correlation function
A probabilistic scheme is presented for simulating evolution of polycrystalline microstructures during deformation. Microstructure images are described using a compact descriptor called the nearest–neighbor conditional orientation correlation function, defined as the probability density of occurrence of a crystal orientation at one pixel distance from a known orientation. The neighborhood infor...
متن کاملTwo - Point Angular Correlation Function )
The Two Point Angular Correlation Function (TPACF) is a mathematical equation that has applications in many areas. In our project, the Two Point Angular Correlation Function is used as a way to measure the probability of finding an astronomical body at a given angular distance from another astronomical body. We were given working sequential code as a starting point. The sequential code took in ...
متن کاملThe Two - Point Correlation Function at Redshift
We present the results of a study of the two-point correlation function for a sample of field galaxies taken from the CNOC cluster survey. The sample consists of 144 galaxies within a contiguous region of space subtending 225 square arcminutes. The objects have r-band magnitudes 17.0 ≤ r ≤ 21.7 and redshifts 0.21 ≤ z ≤ 0.53. The median redshift of the sample is z̄ = 0.36. The real space correlat...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Experimental and Theoretical Physics Letters
سال: 1998
ISSN: 0021-3640,1090-6487
DOI: 10.1134/1.567856